Divide-and-Conquer Information-Based Optimal Subdata Selection Algorithm
نویسندگان
چکیده
منابع مشابه
An Optimal Divide-Conquer Algorithm for 2D Skyline Queries
Skyline query processing is fundamental to many applications including multi-criteria decision making. In this paper, we will present an optimal algorithm for computing skyline in the two dimensional space. The algorithm has the progressive nature and adopts the divide-conquer paradigm. It can be shown that our algorithm achieves the minimum I/O costs, and is more efficient and scalable than th...
متن کاملChessboard Coverage Teaching Based on Divide-and-Conquer Algorithm
Though the divide-and-conquer algorithm is a powerful technology, but it is difficult to be used in practice, so the design of this algorithm should be regulated in the teaching. In this article, the teaching process and the characters of the divide-and-conquer algorithm are studied when solving the problem of chessboard coverage. Aiming at the deficiency that the existing teaching method uses ...
متن کاملDivide and Conquer : A component-based qualitative simulation algorithm
Traditionally, qualitative simulation uses a global, state--based representation to describe the behavior of an imprecisely defined dynamical system . This representation, however, is inherently limited in its ability to scale to larger systems since it provides a complete temporal ordering of all unrelated events thus resulting in combinatoric branching in the behavioral description . The DecS...
متن کاملA Divide-and-Conquer Discretization Algorithm
The problem of real value attribute discretization can be converted into the reduct problem in the Rough Set Theory, which is NP-hard and can be solved by some heuristic algorithms. In this paper we show that the straightforward conversion is not scalable and propose a divide-and-conquer algorithm. This algorithm is fully scalable and can reduce the time complexity dramatically especially while...
متن کاملDivide and Conquer
An instance of the given problem is divided into easier instances of the same problem, which are solved recursively and then combined to create a solution to the original instance. Of course, divide and conquer is not suitable for every problem. A divide and conquer approach will only work if the problem is easily divided into a small number of easier sub-problems, and the solution to the entir...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Theory and Practice
سال: 2019
ISSN: 1559-8608,1559-8616
DOI: 10.1007/s42519-019-0048-5